The Schreier-Sims algorithm for matrix groups
نویسنده
چکیده
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for matrix groups. The standard Schreier-Sims algorithm is described in some detail, followed by descriptions of the probabilistic Schreier-Sims algorithm and the Schreier-Todd-Coxeter-Sims algorithm. Then we discuss our implementation and some optimisations, and finally we report on the performance of our implementation, as compared to the existing implementation in GAP, and we give benchmark results. The conclusion is that our implementation in some cases is faster and consumes much less memory.
منابع مشابه
Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups
We consider the application of the Schreier-Sims algorithm and its variations to matrix groups defined over finite fields. We propose a new algorithm for the selection of the base points and demonstrate that it both improves the performance of the algorithm for a large range of examples and significantly extends the range of application. In particular, the random Schreier-Sims algorithm, with t...
متن کاملThe Schreier-Sims algorithm
A base and strong generating set provides an effective computer representation for a permutation group. This representation helps us to calculate the group order, list the group elements, generate random elements, test for group membership and store group elements efficiently. Knowledge of a base and strong generating set essentially reduces these tasks to the calculation of certain orbits. Giv...
متن کاملComputable Subgroup Chains and Shadowing
We present a new structural framework for computational group theory, based on chains of subgroups. This extends existing methods, such as Schreier-Sims techniques for permutation groups. This framework is now a part of the GAP 4 computational algebra system. It will be useful for implementing the matrix group recognition project.
متن کاملNew Canonical Representative Marking Algorithms for Place/Transition-Nets
Symmetries of a Place/Transition-net can be exploited during the reachability analysis by considering only one representative marking in each orbit induced by the symmetries. In this report, three new algorithms for transforming a marking into a symmetric canonical representative marking are described. All the algorithms depend on the precalculation of a SchreierSims representation for the symm...
متن کاملOn the Sims Conjecture and Distance Transitive Graphs
Charles Sims suggested that this should be true in [11]. Much work has been done since—see for instance the papers of Thompson [15], Wielandt [17] and Knapp [6]. In particular, Thompson proved in [15] the existence of a function g such that for any G as above there is a prime p and a normal p-subgroup P of G with |Ga: P\ ^ g(d). Nevertheless, the conjecture has remained open until now. As a con...
متن کامل